The cluster problem in constrained global optimization
نویسندگان
چکیده
منابع مشابه
The cluster problem in multivariate global optimization
We consider branch and bound methods for enclosing all unconstrained global minimizers of a nonconvex nonlinear twice-continuously differentiable objective function. In particular, we consider bounds obtained with interval arithmetic, with the “midpoint test,” but no acceleration procedures. Unless the lower bound is exact, the algorithm without acceleration procedures in general gives an undes...
متن کاملThe Phase Problem: A Problem in Constrained Global Optimization
It is now almost 200 years since Gauss, a teenager at the time, formulated his famous principle of least-squares and used it to determine, for the first time, the orbit of one of the asteroids, a problem which had defeated astronomers for years. When applied to the crystallographic phase problem, least-squares leads directly to the formulation of the minimal principle, which effectively replace...
متن کاملThe Cluster Problem in Global Optimization the Univariate Case
We consider a branch and bound method for enclosing all global minimizers of a nonlinear C2 or C1 objective function. In particular, we consider bounds obtained with interval arithmetic, along with the “midpoint test,” but no acceleration procedures. Unless the lower bound is exact, the algorithm without acceleration procedures in general gives an undesirable cluster of intervals around each mi...
متن کاملsolution of security constrained unit commitment problem by a new multi-objective optimization method
چکیده-پخش بار بهینه به عنوان یکی از ابزار زیر بنایی برای تحلیل سیستم های قدرت پیچیده ،برای مدت طولانی مورد بررسی قرار گرفته است.پخش بار بهینه توابع هدف یک سیستم قدرت از جمله تابع هزینه سوخت ،آلودگی ،تلفات را بهینه می کند،و هم زمان قیود سیستم قدرت را نیز برآورده می کند.در کلی ترین حالتopf یک مساله بهینه سازی غیر خطی ،غیر محدب،مقیاس بزرگ،و ایستا می باشد که می تواند شامل متغیرهای کنترلی پیوسته و گ...
Optimal Anytime Constrained Simulated Annealing for Constrained Global Optimization
In this paper we propose an optimal anytime version of constrained simulated annealing (CSA) for solving constrained nonlinear programming problems (NLPs). One of the goals of the algorithm is to generate feasible solutions of certain prescribed quality using an average time of the same order of magnitude as that spent by the original CSA with an optimal cooling schedule in generating a solutio...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Global Optimization
سال: 2017
ISSN: 0925-5001,1573-2916
DOI: 10.1007/s10898-017-0531-z